Classifying molecular sequences using a linkage graph with their pairwise similarities

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classifying Molecular Sequences Using a Linkage Graph With Their Pairwise Similarities

This paper presents a method for classifying a large and mixed set of uncharacterized sequences provided by genome projects. As the measure of sequence similarity, we use similarity score computed by a method based on the dynamic programming (DP), such as the Smith–Waterman local alignment algorithm. Although comparison by DP based method is very sensitive, when given sequences include a family...

متن کامل

Spectral Inference of a Directed Acyclic Graph Using Pairwise Similarities

A gene ontology graph is a directed acyclic graph (DAG) which represents relationships among biological processes. Inferring such a graph using a gene similarity matrix is NP-hard in general. Here, we propose an approximate algorithm to solve this problem efficiently by reducing the dimensionality of the problem using spectral clustering. We show that the original problem can be simplified to t...

متن کامل

Efficient Image Segmentation Using Pairwise Pixel Similarities

Image segmentation based on pairwise pixel similarities has been a very active field of research in recent years. The drawbacks common to these segmentation methods are the enormous space and processor requirements. The contribution of this paper is a general purpose two-stage preprocessing method that substantially reduces the involved costs. Initially, an oversegmentation into small coherent ...

متن کامل

A Clustering Method for Molecular Sequences based on Pairwise Similarity

This paper presents a method for clustering a large and mixed set of uncharacterized sequences provided by genome projects. As the measure of the clustering, we use a fast approximation of sequence similarity (FASTA score). However, in the case to detect similarity between two sequences that are much diverged in evolutionary process, FASTA sometimes underestimates the similarity compared to the...

متن کامل

Clustering Molecular Sequences with Their Components.

Motivation: Several methods in genetic information have recently been developed to estimate classification of protein sequences through their sequence similarity. These methods are essential for understanding the function of predicted open reading frames (ORFs) and their molecular evolutionary processes. However, since many protein sequences consist of a number of independently evolved structur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1999

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(98)00091-7